The thickness of a minor-excluded class of graphs
نویسندگان
چکیده
The thickness problem on graphs is NP-hard and only few results concerning this graph invariant are known. Using a decomposition theorem of Truemper, we show that the thickness of the class of graphs without G 12-minors is less than or equal to two (and therefore, the same is true for the more well-known class of the graphs without K 5-minors). Consequently, the thickness of this class of graphs can be determined with a planarity testing algorithm in linear time.
منابع مشابه
Excluded-minor Characterization of Apex-outerplanar
The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K4 and K2,3. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this class.
متن کاملOn 3-Connected Graphs of Path-Width at Most Three
It is known that the list of excluded minors for the minor-closed class of graphs of path-width 6 3 numbers in the millions. However, if we restrict the class to 3-connected graphs of path-width 6 3, then we can characterize it by five excluded minors.
متن کاملSome minor-closed classes of signed graphs
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.
متن کاملBranch-Width and Rota's Conjecture
We begin by giving some background to this result. A matroid M is an excluded minor for a minor-closed class of matroids if M is not in the class but all proper minors of M are. It is natural to attempt to characterize a minor-closed class of matroids by giving a complete list of its excluded minors. Unfortunately, a minor-closed class of matroids can have an infinite number of excluded minors....
متن کاملSparsity and dimension
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Nešetřil and Ossona de Mendez as a model for sparsity in graphs, is a property that is naturally satisfied by a wide range of graph classes, from graph structure theory (graphs excluding a minor or a topological minor) to graph drawing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 182 شماره
صفحات -
تاریخ انتشار 1998